Matchings in vertex-transitive bipartite graphs
نویسندگان
چکیده
منابع مشابه
Matchings in Vertex-transitive Bipartite Graphs
A theorem of A. Schrijver asserts that a d–regular bipartite graph on 2n vertices has at least ( (d− 1)d−1 dd−2 )n perfect matchings. L. Gurvits gave an extension of Schrijver’s theorem for matchings of density p. In this paper we give a stronger version of Gurvits’s theorem in the case of vertex-transitive bipartite graphs. This stronger version in particular implies that for every positive in...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملInduced matchings in bipartite graphs
All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...
متن کاملVertex-transitive CIS graphs
A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and o...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2016
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-016-1375-9